Vertex-disjoint copies of K4- in graphs
نویسنده
چکیده
Let K− 4 denote the graph obtained from K4 by removing one edge. Let k be an integer with k ≥ 2. Kawarabayashi conjectured that if G is a graph of order n ≥ 4k + 1 with σ2(G) ≥ n + k, then G has k vertex-disjoint copies of K− 4 . In this paper, we settle this conjecture affirmatively.
منابع مشابه
On a self-dual (1024)-configuration
A connected edge-disjoint union Y of 102 tetrahedra (copies ofK4) is constructed which is Menger graph of a self-dual (1024)-configuration and K4-ultrahomogeneous. As Y is not a line graph, we ask whether there exists a non-line-graphical K4-ultrahomogeneous Menger graph of a self-dual (n4)-configuration which is connected edge-disjoint union of n copies of K4, for n / ∈ {42, 102}. Moreover, Y ...
متن کاملVertex-Disjoint Copies of K1 + (K1 ∪K2) in Graphs
Let S denote the graph obtained from K4 by removing two edges which have an endvertex in common. Let k be an integer with k ≥ 2. Let G be a graph with |V (G)| ≥ 4k and σ2(G) ≥ |V (G)|/2 + 2k− 1, and suppose that G contains k vertex-disjoint triangles. In the case where |V (G)| = 4k+2, suppose further that G K4t+3 ∪ K4k−4t−1 for any t with 0 ≤ t ≤ k − 1. Under these assumptions, we show that G c...
متن کاملOn C-ultrahomogeneous graphs and digraphs
The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs and studied for the twelve cubic distance transitive graphs, with C formed by g-cycles and (k − 1)-paths, where g = girth and k = arc-transitivity. Excluding the Petersen, Heawood and Foster (90 vertices) graphs, one can go further by considering the (k− 1)-powers of g-cycles under orientation assignments p...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملThe distance-3 graph of the Biggs-Smith graph
The distance-3 graph S3 of the Biggs-Smith graph S is shown to be: (a) a connected edge-disjoint union of 102 tetrahedra (copies of K4) and as such the K4-ultrahomogeneous Menger graph of a self-dual (1024)-configuration; (b) a union of 102 cuboctahedra, (copies of L(Q3)), with no 2 such cuboctahedra having a common chordless 4-cycle; (c) not a line graph. Moreover, S3 is shown to have a C-ultr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2005